The Colin de Verdière number and graphs of polytopes

نویسنده

  • Ivan Izmestiev
چکیده

The Colin de Verdière number μ(G) of a graph G is the maximum corank of a Colin de Verdière matrix for G (that is, of a Schrödinger operator on G with a single negative eigenvalue). In 2001, Lovász gave a construction that associated to every convex 3-polytope a Colin de Verdière matrix of corank 3 for its 1-skeleton. We generalize the Lovász construction to higher dimensions by interpreting it as minus the Hessian matrix of the volume of the polar dual. As a corollary, μ(G) ≥ d if G is the 1-skeleton of a convex d-polytope. Determination of the signature of the Hessian of the volume is based on the second Minkowski inequality for mixed volumes and on Bol’s condition for equality.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colin de Verdière number and graphs of polytopes

To every convex d-polytope with the dual graph G a matrix is associated. The matrix is shown to be a discrete Schrödinger operator on G with the second least eigenvalue of multiplicity d. This implies that the Colin de Verdière parameter of G is greater or equal d. The construction generalizes the one given by Lovász in the case d = 3.

متن کامل

The Colin de Verdière parameter, excluded minors, and the spectral radius

In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all graphs of Colin de Verdière parameter at most m. We also characterize graphs of maximum spectral radius with no H as a minor when H is either Kr or Ks,t. Interestingly, the extremal graphs match those which maximize the number of edges over all graphs with no H as a minor when r and s are ...

متن کامل

The Colin De Verdière Graph Parameter for Threshold Graphs

We consider Schrödinger operators on threshold graphs and give an explicit construction of a Colin de Verdière matrix for each connected threshold graph G of n vertices. We conclude the Colin de Verdière graph parameter μ(G) satisfies μ(G) ≥ n− i− 1, where i is the number of isolates in the graph building sequence. The proof is algorithmic in nature, constructing a particular Colin de Verdiére ...

متن کامل

Ela Colin De Verdière Parameters of Chordal Graphs

The Colin de Verdière parameters, μ and ν, are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal graphs. For ν the calculation is based solely on maximal cliques, while for μ the calculation depends on split subgraphs. For the case of μ our work extends some recent work on com...

متن کامل

Lecture Notes Mpri 2.38.1 Geometric Graphs, Triangulations and Polytopes

These lecture notes on “Geometric Graphs, Triangulations and Polytopes” cover the material presented for half of the MPRI Master Course 2.38.1 entitled “Algorithmique et combinatoire des graphes géométriques”. The other half of the course, taught by Éric Colin de Verdière, focusses on “Algorithms for embedded graphs” [dV]. Announcements and further informations on the course are available onlin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008